Revenue Maximization in the Dynamic Knapsack Problem Deniz Dizdar, Alex Gershkov and Benny MoldovanuAbstract

Source URL: pluto.huji.ac.il

• Operations research
• Dynamic programming
• Mathematical optimization
• Combinatorial optimization
• Bellman equation
• Control theory
• Knapsack problem
• Mechanism design

Improved Results on Online Dynamic Bin Packing Mihai Burcea (Speaker) 1 †‡

Source URL: cgi.csc.liv.ac.uk

• Packing problems
• Bin packing problem
• Sphere packing
• Bin
• Competitive analysis
• Knapsack problem
• Generalized assignment problem

CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016

Source URL: theory.stanford.edu

• NP-complete problems
• Knapsack problem
• Set cover problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• Greedy algorithm
• Dynamic programming
• Minimum spanning tree
• Algorithm
• Time complexity
• NP

CS264: Homework #7 Due by midnight on Wednesday, November 12, 2014 Instructions: (1) Students taking the course pass-fail should complete the exercises. Students taking the course for a letter grade should complete both

Source URL: theory.stanford.edu

• NP-complete problems
• Combinatorial optimization
• Maximum cut
• Knapsack problem

Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)

Source URL: bioinfo.ict.ac.cn

• Operations research
• Dynamic programming
• Combinatorial optimization
• Packing problems
• Cryptography
• Knapsack problem
• Subset sum problem
• Approximation algorithm
• Algorithm
• Greedy algorithm
• Heuristic
• Branch and bound

Computer Science Education 2004, Vol. 14, No. 3, pp. 235–248 Teaching Algorithm Efficiency at CS1 Level: A Different Approach Judith Gal-Ezer, Tamar Vilner, and Ela Zur

Source URL: www.openu.ac.il

• Theoretical computer science
• Analysis of algorithms
• Dynamic programming
• Software optimization
• Algorithm
• Mathematical logic
• Selection algorithm
• Recursion
• Sort
• Best
• worst and average case
• Knapsack problem
• Matrix chain multiplication

Efficient Algorithms with Performance Guarantees for the Stochastic Multiple-Choice Knapsack Problem Long Tran–Thanh∗ and Yingce Xia† and Tao Qin‡ and Nicholas R. Jennings§ Abstract We study the stochastic multi

Source URL: www.orchid.ac.uk

39 An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem TIMOTHY A. DAVIS, University of Florida WILLIAM W. HAGER, University of Florida JAMES T. HUNGERFORD, University of Florida

Source URL: faculty.cse.tamu.edu

11. A PPROXIMATION A LGORITHMS ‣ load balancing ‣ center selection ‣ pricing method: vertex cover ‣ LP rounding: vertex cover ‣ generalized load balancing

Source URL: vigna.di.unimi.it

• Scheduling
• Operations research
• NP-complete problems
• Complexity classes
• Combinatorial optimization
• Makespan
• Knapsack problem
• NP
• Algorithm
• Vertex cover
• Approximation algorithm
• Job shop scheduling

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis May 19, Spring 2011

Source URL: courses.csail.mit.edu

• Computational complexity theory
• Mathematics
• Theory of computation
• Analysis of algorithms
• Operations research
• Asymptotic analysis
• Combinatorial optimization
• Dynamic programming
• Master theorem
• Big O notation
• Knapsack problem
• Time complexity